Delay Reduction in Redundant Trees for Pre-Planned Protection against Single LinWNode Failure in %Connected Graphs

نویسندگان

  • Guoliang Xue
  • Li Chen
چکیده

~btr~ctWe study qualily of service Issues In prephnned recovery using rednodant treea in 2-vertex connected phr and 2edge c o n n e d graphs. in partlcaiar, we present e g e n t benristic dgorithma h r Bndmg a pdr of workhg-protection hres with s m d delay In the working tree. Extensive computational results show that onr dgorkthms reduce the avenge dehy In the worklog tree by 60% to 9OY.. Many cbnlleoging problems remnln open.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Delay reduction in redundant trees for preplanned protection against single link/node failure in 2-connected graphs

We study quality of service issues in preplanned recovery using redundant trees in 2-vertex connected graphs and 2edge connected graphs. In particular, we present efficient heuristic algorithms for finding a pair of working-protection trees with small delay in the working tree. Extensive computational results show that our algorithms reduce the average delay in the working tree by 60% to 90%. M...

متن کامل

Finding Multiple Maximally Redundant Trees in Linear Time

Redundant trees are directed spanning trees, which provide disjoint paths towards their roots. Therefore, this concept is widely applied in the literature both for providing protection and load sharing. The fastest algorithm can find multiple redundant trees, a pair of them rooted at each vertex, in linear time. Unfortunately, edgeor vertex-redundant trees can only be found in 2-edgeor 2-vertex...

متن کامل

The maximal total irregularity of some connected graphs

The total irregularity of a graph G is defined as 〖irr〗_t (G)=1/2 ∑_(u,v∈V(G))▒〖|d_u-d_v |〗, where d_u denotes the degree of a vertex u∈V(G). In this paper by using the Gini index, we obtain the ordering of the total irregularity index for some classes of connected graphs, with the same number of vertices.

متن کامل

Experimental Study for Protection of Piers Against Local Scour Using Slots

The most important causes of bridge failure are local scour. In this study, laboratory experiments were conducted to investigate the effectiveness of slot as a protection device in reduction of depth of scour at cylindrical piers under clear water flow conditions. The development time of scour depth at the circular pier with and without a slot as a protection device was conducted. The experimen...

متن کامل

NUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS

In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004